منابع مشابه
Canonical Orderings on Grids
Jump Point Search, an algorithm developed for fast search on uniform cost grids, has successfully improved the performance of grid-based search. But, the approach itself is actually a set of diverse ideas applied together. This paper decomposes the algorithm and gradually re-constructs it, showing the component pieces from which the algorithm is constructed. In this process, we are able to defi...
متن کاملNotes on Transformation Orderings
An important property and also a crucial point of a term rewriting system is its termination. Transformation or-derings, developed by Bellegarde & Lescanne strongly based on a work of Bachmair & Dershowitz, represent a general technique for extending orderings. The main characteristics of this method are two rewriting relations, one for transforming terms and the other for ensuring the well-fou...
متن کاملAutomata on Linear Orderings
We consider words indexed by linear orderings. These extend finite, (bi-)infinite words and words on ordinals. We introduce finite automata and rational expressions for these words. We prove that for countable scattered linear orderings, these two notions are equivalent. This result extends Kleene’s theorem.
متن کاملRemarks on P-orderings and simultaneous orderings (Preprint)
1 Preliminary definitions Definition 1 (S-Lenstra constant) Let K be a number field, and Z K its ring of integers. Let S be a finite set of valuations of K containing all the infinite valuations. Let L be a maximal subset of Z K such that x, y ∈ L ⇒ x − y ∈ Z if L = {a 0 , a 1 ,. .. , a k }. In fact we will use this second form of the condition. Remark 2 We can assume that if L is such a maxima...
متن کاملOrderings on semirings
Though more general definitions are sometimes used, for this paper a semiring will be defined to be a set S with two operations + (addition) and 9 (multiplication); with respect to addition, S is a commutative monoid with 0 as its identity dement 9 With respect to multiplication, S is a (generaily noncommutat ive) monoid with 1 as its identity element. Connecting the two algebraic structures ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 1993
ISSN: 0166-8641
DOI: 10.1016/0166-8641(93)90021-5